An on-line bin-batching problem
نویسنده
چکیده
In this note we consider a new problem, the so-called bin-batching problem related to variablesized bin covering. A best possible on-line algorithm is presented. ? 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
On-line batching problems
We introduce on-line batching problems as a new class of on-line combinatorial problems. In an on-line batching problem the task is to chop batches from a growing queue of objects, such that the cost is minimized, where the cost consists of setup cost for each batch, processing cost for each batch, and holding cost for each object that is not processed immediately. For on-line batching problems...
متن کاملOn Bottleneck Product Rate Variation Problem with Batching
The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...
متن کاملArtificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملMessage batching in wireless sensor networks - A perturbation analysis approach
We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We consider a time-based batching approach. We first develop baseline analytical models based on Markovian assumptions, derive conditions under which batching is profitable, and explicitly determine a batching time that optimizes a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 108 شماره
صفحات -
تاریخ انتشار 2001